Quasi - Random Subsets of Z
نویسنده
چکیده
منابع مشابه
On Partitioning Sidon Sets with Quasi-independent Sets
There is a construction of random subsets of Z in which almost every subset is Sidon (this was first done by Katznelson). More is true: almost every subset is the finite union of quasi-independent sets. Also, if every Sidon subset of Z\{0} is the finite union of quasi-independent sets, then the required number of quasi-independent sets is bounded by a function of the Sidon constant. Analogs of ...
متن کاملRandom Fixed Points of M U Ltifu N Ctio N S in Games an D Dynam Ic Programming
Recently several authors demonstrated random fixed point theorems for various classes of multifunctions ([7], [8], [2], [3], [12], [10]). On the other hand we do not know any work on applications of these theorems. In this paper we apply to games and dynamic programming a random analogue of the Fan-Kakutani fixed point theorem. We consider a zero-sum two-person game depending on a random parame...
متن کاملCenter--like subsets in rings with derivations or epimorphisms
We introduce center-like subsets Z*(R,f), Z**(R,f) and Z1(R,f), where R is a ring and f is a map from R to R. For f a derivation or a non-identity epimorphism and R a suitably-chosen prime or semiprime ring, we prove that these sets coincide with the center of R.
متن کاملBohr Cluster Points of Sidon Sets
If there is a Sidon subset of the integers Z which has a member of Z as a cluster point in the Bohr compactification of Z, then there is a Sidon subset of Z which is dense in the Bohr compactification. A weaker result holds for quasiindependent and dissociate subsets of Z. It is a long standing open problem whether Sidon subsets of Z can be dense in the Bohr compactification of Z ([LR]). Yitzha...
متن کاملLarge Holes in Quasi-Random Graphs
Quasi-random graphs have the property that the densities of almost all pairs of large subsets of vertices are similar, and therefore we cannot expect too large empty or complete bipartite induced subgraphs in these graphs. In this paper we answer the question what is the largest possible size of such subgraphs. As an application, a degree condition that guarantees the connection by short paths ...
متن کامل